Non-uniform Turán-type problems
نویسندگان
چکیده
Given positive integers n, k, t, with 2 ≤ k ≤ n, and t < 2, let m(n, k, t) be the minimum size of a family F of (nonempty distinct) subsets of [n] such that every k-subset of [n] contains at least t members of F , and every (k − 1)-subset of [n] contains at most t− 1 members of F . For fixed k and t, we determine the order of magnitude of m(n, k, t). We also consider related Turán numbers T≥r(n, k, t) and Tr(n, k, t), where T≥r(n, k, t) (Tr(n, k, t)) denotes the minimum size of a family F ⊂ ( [n] ≥r ) (F ⊂ ( [n] r ) ) such that every k-subset of [n] contains at least t members of F . We prove that T≥r(n, k, t) = (1+ o(1))Tr(n, k, t) for fixed r, k, t with t ≤ ( k r ) and n→∞.
منابع مشابه
Turán Problems on Non-Uniform Hypergraphs
A non-uniform hypergraph H = (V,E) consists of a vertex set V and an edge set E ⊆ 2V ; the edges in E are not required to all have the same cardinality. The set of all cardinalities of edges in H is denoted by R(H), the set of edge types. For a fixed hypergraph H, the Turán density π(H) is defined to be limn→∞maxGn hn(Gn), where the maximum is taken over all H-free hypergraphs Gn on n vertices ...
متن کاملTurán Problems and Shadows III: Expansions of Graphs
The expansion G of a graph G is the 3-uniform hypergraph obtained from G by enlarging each edge of G with a new vertex disjoint from V (G) such that distinct edges are enlarged by distinct vertices. Let ex3(n, F ) denote the maximum number of edges in a 3-uniform hypergraph with n vertices not containing any copy of a 3-uniform hypergraph F . The study of ex3(n,G ) includes some well-researched...
متن کاملA survey of Turán problems for expansions
The r-expansion G of a graph G is the r-uniform hypergraph obtained from G by enlarging each edge of G with a vertex subset of size r − 2 disjoint from V (G) such that distinct edges are enlarged by disjoint subsets. Let exr(n, F ) denote the maximum number of edges in an r-uniform hypergraph with n vertices not containing any copy of the r-uniform hypergraph F . Many problems in extremal set t...
متن کاملTriple Systems Not Containing a Fano Configuration
Given a 3-uniform hypergraph F , let ex3(n,F) denote the maximum possible size of a 3-uniform hypergraph of order n that does not contain any subhypergraph isomorphic to F . Our terminology follows that of [16] and [10], which are comprehensive survey articles of Turán-type extremal graph and hypergraph problems, respectively. Also see the monograph of Bollobás [2]. There is an extensive litera...
متن کاملTurán Numbers for 3-Uniform Linear Paths of Length 3
In this paper we confirm a special, remaining case of a conjecture of Füredi, Jiang, and Seiver, and determine an exact formula for the Turán number ex3(n;P 3 3 ) of the 3-uniform linear path P 3 3 of length 3, valid for all n. It coincides with the analogous formula for the 3-uniform triangle C3 3 , obtained earlier by Frankl and Füredi for n > 75 and Csákány and Kahn for all n. In view of thi...
متن کاملMulticolor Ramsey Numbers and Restricted Turán Numbers for the Loose 3-Uniform Path of Length Three
Let P denote a 3-uniform hypergraph consisting of 7 vertices a, b, c, d, e, f, g and 3 edges {a, b, c}, {c, d, e}, and {e, f, g}. It is known that the r-colored Ramsey number for P is R(P ; r) = r + 6 for r = 2, 3, and that R(P ; r) 6 3r for all r > 3. The latter result follows by a standard application of the Turán number ex3(n;P ), which was determined to be ( n−1 2 ) in our previous work. We...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 111 شماره
صفحات -
تاریخ انتشار 2005